1466B - Last minute enhancements - CodeForces Solution

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int,int> pi;
#define repi(i, a, b) for(int i=a; i<b; i++)
#define rrepi(i, a, b) for(int i=a; i>=b; i--)
typedef vector<ll> vl;
typedef pair<ll,ll> pl;
#define repl(i, a, b) for(ll i=a; i<b; i++)
#define rrepl(i, a, b) for(ll i=a; i>=b; i--)
#define srt(a) sort(a.begin(), a.end());
#define rsrt(a) sort(a.rbegin(), a.rend());
#define rev(a) reverse(a.begin(), a.end());
#define mod(n) (((ll)n%1000000007+1000000007)%1000000007)
const int N=1e5+10;

void solve(){
    int n;
    cin>>n;
    vi x(n);
    map<int,int> mp;
    repi(i,0,n){
        cin>>x[i];
        mp[x[i]]++;
    }
    repi(i,0,n){
        if(mp[x[i]]>1){
            mp[x[i]]--;
            x[i]+=1;
            mp[x[i]]++;
        }
    }
    cout<<mp.size()<<"\n";
}

int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
ll t; cin>>t; while(t--)
solve();
return 0;
}